Epistemic Foundations for Backward Induction: An Overview

نویسندگان

  • Andrés Perea
  • A. Perea
چکیده

In this survey we analyze and compare various sufficient epistemic conditions for backward induction that have been proposed in the literature. To this purpose we present a simple epistemic base model for games with perfect information, and express the conditions of the different models in terms of our base model. This will enable us to explictly analyze the differences and similarities between the various sufficient conditions for backward induction.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

TR-2009006: Intelligent Players

Rational decisions depend on what players know, hence an appropriate epistemic analysis is an integral element of the foundations of Game Theory. We suggest a general logical approach for studying games which consists of formalizing rationality and games in epistemic logic and deriving their properties in the resulting logical system. We study a number of examples and demonstrate that our model...

متن کامل

Intelligent Players

Rational decisions depend on what players know, hence an appropriate epistemic analysis is an integral element of the foundations of Game Theory. We suggest a general logical approach for studying games which consists of formalizing rationality and games in epistemic logic and deriving their properties in the resulting logical system. We study a number of examples and demonstrate that our model...

متن کامل

King of the Hill: Giving Backward Induction its Best Shot∗

We study a class of deceptively similar games, which however have different player sets and predictions that vary with their cardinality. The economic, biological, political, and psychological applications are many. The game-theoretic principles involved are compelling as predictions rely on weaker and less controversial epistemic foundations than needed to justify backward inductions more gene...

متن کامل

Branching Time, Perfect Information Games, and Backward Induction

The logical foundations of game-theoretic solution concepts have so far been explored within the con ̄nes of epistemic logic. In this paper we turn to a di®erent branch of modal logic, namely temporal logic, and propose to view the solution of a game as a complete prediction about future play. The branching time framework is extended by adding agents and by de ̄ning the notion of prediction. A sy...

متن کامل

Working Paper Series An epistemic characterization of generalized backward induction

We investigate the extension of backward-induction to von Neumann extensive games (where information sets have a synchronous structure) and provide an epistemic characterization of it. Extensions of the idea of backwardinduction were proposed by Penta (2009) and later by Perea (2013), who also provided an epistemic characterization in terms of the notion of common belief in future rationality. ...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2007